Symbol based convergence analysis in multigrid methods for saddle point problems
نویسندگان
چکیده
Saddle point problems arise in a variety of applications, e.g., when solving the Stokes equations. They can be formulated such that system matrix is symmetric, but indefinite, so variational convergence theory usually used to prove multigrid cannot applied. In 2016 paper Numerische Mathematik Notay has presented different algebraic approach analyzes properly preconditioned saddle problems, proving two-grid method. The present where blocks are circulant within this framework. It contains sufficient conditions for and optimal parameters preconditioning unilevel multilevel problem smoother used. analysis based on generating symbols blocks. Further, it shown structure kept coarse level, allowing recursive application W- or V-cycle studying “level independency” property. Numerical results demonstrate efficiency proposed method Toeplitz case.
منابع مشابه
Multigrid methods for saddle point problems: Stokes and Lamé systems
We develop new multigrid methods for a class of saddle point problems that include the Stokes system in fluid flow and the Lamé system in linear elasticity as special cases. The new smoothers in the multigrid methods involve optimal preconditioners for the discrete Laplace operator. We prove uniform convergence of the W -cycle algorithm in the energy norm and present numerical results for W -cy...
متن کاملMultigrid Methods for Saddle Point Problems: Darcy Systems
We design and analyze multigrid methods for the saddle point problems resulting from Raviart-Thomas-Nédélec mixed finite element methods (of order at least 1) for the Darcy system in porous media flow. Uniform convergence of the W -cycle algorithm in a nonstandard energy norm is established. Extensions to general second order elliptic problems are also addressed.
متن کاملAdaptive Wavelet Methods for Saddle Point Problems - Optimal Convergence Rates
In this paper an adaptive wavelet scheme for saddle point problems is developed and analysed. Under the assumption that the underlying continuous problem satisfies the inf-sup condition it is shown in the first part under which circumstances the scheme exhibits asymptotically optimal complexity. This means that within a certain range the convergence rate which relates the achieved accuracy to t...
متن کاملSymbol-Based Multigrid Methods for Galerkin B-Spline Isogeometric Analysis
We consider the stiffness matrices coming from the Galerkin B-spline isogeometric analysis approximation of classical elliptic problems. By exploiting specific spectral properties compactly described by a symbol, we design efficient multigrid methods for the fast solution of the related linear systems. We prove the optimality of the two-grid methods (in the sense that their convergence rate is ...
متن کاملMultigrid relaxation methods for systems of saddle point type ✩
In this paper, we give an overview of multigrid methods for two systems of equations, namely the Stokes equations and the incompressible poroelasticity equations. We emphasize the saddle point type aspect in these two systems and discuss their discretization on staggered and collocated grids. The basic problem is that of smoothing a system of equations that has a zero (or almost zero) block in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2023
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2023.04.016